A better upper bound on the number of triangulations of a planar point set
نویسندگان
چکیده
We show that a point set of cardinality n in the plane cannot be the vertex set of more than 59 O(n−6) straight-edge triangulations of its convex hull. This improves the previous upper bound of 276.75n+O(log(n)).
منابع مشابه
TEL-AVIV UNIVERSITY RAYMOND AND BEVERLY SACKLER FACULTY OF EXACT SCIENCES BLAVATNIK SCHOOL OF COMPUTER SCIENCE Counting Triangulations of Planar Point Sets
We study the maximal number of triangulations that a planar set of n points can have, and show that it is at most 30n. This new bound is achieved by a careful optimization of the charging scheme of Sharir and Welzl (2006), which has led to previous best upper bound of 43n for the problem. Moreover, this new bound is useful for bounding the number of other types of planar (i.e., crossing free) s...
متن کاملCounting Triangulations of Planar Point Sets
We study the maximal number of triangulations that a planar set of n points can have, and show that it is at most 30n. This new bound is achieved by a careful optimization of the charging scheme of Sharir and Welzl (2006), which has led to the previous best upper bound of 43n for the problem. Moreover, this new bound is useful for bounding the number of other types of planar (i.e., crossing-fre...
متن کاملOn trees attaining an upper bound on the total domination number
A total dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every vertex of $G$ has a neighbor in $D$. The total domination number of a graph $G$, denoted by $gamma_t(G)$, is~the minimum cardinality of a total dominating set of $G$. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International ournal of Graphs and Combinatorics 1 (2004), 6...
متن کاملCompatible triangulations and point partitions by series-triangular graphs
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to prove an upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets. The problem is generalized to finding compatible triangulations for more than two point sets and we show that such triangulations can be constructed with only a l...
متن کاملCounting Simple Polygonizations of Planar Point Sets
Given a finite planar point set, we consider all possible spanning cycles whose straight line realizations are crossing-free – such cycles are also called simple polygonizations – and we are interested in the number of such simple polygonizations a set of N points can have. While the minumum number over all point configurations is easy to obtain – this is 1 for points in convex position –, the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 102 شماره
صفحات -
تاریخ انتشار 2003